On the maximal size of independent generating sets of PSL2(q)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Generating All Maximal Independent Sets

Generating all configurations that satisfy a given specification (e.g., all permutations of n objects that do not fix any object) is a well-studied problem in combinatorics [6]. Graph theory suggests many interesting problems of this type (see, e.g., [7]). Among them, generating all maximal independent sets of a given graph is one that has attracted considerable attention in the past [4,5,8]. (...

متن کامل

the effect of taftan pozzolan on the compressive strength of concrete in the environmental conditions of oman sea (chabahar port)

cement is an essential ingredient in the concrete buildings. for production of cement considerable amount of fossil fuel and electrical energy is consumed. on the other hand for generating one tone of portland cement, nearly one ton of carbon dioxide is released. it shows that 7 percent of the total released carbon dioxide in the world relates to the cement industry. considering ecological issu...

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2002

ISSN: 0021-8693

DOI: 10.1016/s0021-8693(02)00648-8